- disjoint-path routing
- маршрутизация по непереключаемым маршрутам
English-Russian dictionary of telecommunications and their abbreviations. A.V. Alexandrov.. 2004.
disjoint-path routing
Смотреть что такое "disjoint-path routing" в других словарях:
Routing — This article is about routing in networks. For other uses, see Routing (disambiguation). Routing is the process of selecting paths in a network along which to send network traffic. Routing is performed for many kinds of networks, including the… … Wikipedia
Path coloring — In graph theory, path coloring usually refers to one of two problems: * The problem of coloring a (multi)set of paths R in graph G, in such a way that any two paths of R which share an edge in G receive different colors. Set R and graph G are… … Wikipedia
Multipath routing — is the routing technique of using multiple alternative paths through a network, which can yield a variety of benefits such as fault tolerance, increased bandwidth, or improved security. The multiple paths computed might be overlapped, edge… … Wikipedia
Edge disjoint shortest pair algorithm — is an algorithm in computer network routing for generating the shortest pair of edge disjoint paths between a given pair of vertices as follows:* Run the shortest pair algorithm for the given pair of vertices * Replace each edge of the shortest… … Wikipedia
Optical mesh network — Transport network based on SONET/SDH ring architecture Optical mesh networks are a type of telecommunications network. Transport networks, the underlying optical fiber based layer of telecommunications networks, have evolved from DCS (Digital… … Wikipedia
Travelling salesman problem — The travelling salesman problem (TSP) is an NP hard problem in combinatorial optimization studied in operations research and theoretical computer science. Given a list of cities and their pairwise distances, the task is to find a shortest… … Wikipedia
List of NP-complete problems — Here are some of the more commonly known problems that are NP complete when expressed as decision problems. This list is in no way comprehensive (there are more than 3000 known NP complete problems). Most of the problems in this list are taken… … Wikipedia
Network coding — is a technique where, instead of simply relaying the packets of information they receive, the nodes of a network will take several packets and combine them together for transmission. This can be used to attain the maximum possible information… … Wikipedia
County roads in Hennepin County, Minnesota — Hennepin County, Minnesota, United States maintains a number of county routes, many of them county state aid highways (CSAH). This includes a number of streets through the city of Minneapolis. Contents 1 CR 1–CR 25 2 CR 26–CR 50 3 CR 51–CR 75 … Wikipedia
Graph (mathematics) — This article is about sets of vertices connected by edges. For graphs of mathematical functions, see Graph of a function. For statistical graphs, see Chart. Further information: Graph theory A drawing of a labeled graph on 6 vertices and 7 edges … Wikipedia
Solid modeling — The geometry in solid modeling is fully described in 3‑D space; objects can be viewed from any angle. Modeled and ray traced in Cobalt Solid modeling (or modelling) is a consistent set of principles for mathematical and computer modeling of three … Wikipedia
